منابع مشابه
Two Solutions to Incorporate Zero, Successor and Equality in Binary Decision Diagrams
In this article we extend BDDs (binary decision diagrams) for plain propositional logic to the fragment of first order logic, consisting of quantifier free logic with equality, zero and successor. We insert equations with zero and successor in BDDs, and call these objects (0, S, =)-BDDs. We extend the notion of Ordered BDDs in the presence of equality, zero and successor. (0, S, =)-BDDs can be ...
متن کاملN-Gram Analysis Based on Zero-Suppressed BDDs
In present paper, we propose a new method of n-gram analysis using ZBDDs (Zero-suppressed BDDs). ZBDDs are known as a compact representation of combinatorial item sets. Here, we newly apply the ZBDD-based techniques for efficiently handling sets of sequences. Using the algebraic operations defined over ZBDDs, such as union, intersection, difference, etc., we can execute various processings and/...
متن کاملVerification of asynchronous circuits based on zero-suppressed BDDs
Asynchronous circuits, which have no global clocks and work based on the causality relation between signal transitions, potentially have the advantages of high performance and low power dissipation. However, the state spaces of asynchronous circuits are often huge, because unlike synchronous circuits every wire has states. Thus, the formal verification of asynchronous circuits is more difficult...
متن کاملGenerating Frequent Closed Item Sets Based on Zero-suppressed BDDs
(Abstract) Frequent item set mining is one of the fundamental techniques for knowledge discovery and data mining. In the last decade, a number of efficient algorithms for frequent item set mining have been presented, but most of them focused on just enumerating the item set patterns which satisfy the given conditions, and it was a different matter how to store and index the result of patterns f...
متن کاملSymmetric Item Set Mining Using Zero-suppressed BDDs
(Abstract) In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory of Boolean functions, and there have been developed fast symmetry checking methods based on BDDs (Binary Decision Diagrams). Here we discuss the property of symmetric items in data mining problems, and des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2005
ISSN: 0168-0072
DOI: 10.1016/j.apal.2004.10.005